Design of cages with a randomized progressive edge-growth algorithm
نویسندگان
چکیده
منابع مشابه
Improved progressive edge-growth algorithm for fast encodable LDPC codes
The progressive edge-growth (PEG) algorithm is known to construct low-density parity-check (LDPC) codes at finite code lengths with large girths by establishing edges between symbol and check nodes in an edge-by-edge manner. The linear-encoding PEG (LPEG) algorithm, a simple variation of the PEG algorithm, can be applied to generate linear time encodable LDPC codes whose m parity bits p1, p2, ....
متن کاملDesign of LDPC Codes using Multipath EMD Strategies and Progressive Edge Growth
Low-density parity-check (LDPC) codes are capable of achieving excellent performance and provide a useful alternative for high performance applications. However, at medium to high signal-to-noise ratios (SNR), an observable error floor arises from the loss of independence of messages passed under iterative graph-based decoding. In this paper, the error floor performance of short block length co...
متن کاملEdge-superconnectivity of semiregular cages with odd girth
A graph is said to be edge-superconnected if each minimum edge-cut consists of all the edges incident with some vertex of minimum degree. A graph G is said to be a {d, d + 1}semiregular graph if all its vertices have degree either d or d+1. A smallest {d, d+1}-semiregular graph G with girth g is said to be a ({d, d+1}; g)-cage. We show that every ({d, d+1}; g)-cage with odd girth g is edge-supe...
متن کاملinvestigating the feasibility of a proposed model for geometric design of deployable arch structures
deployable scissor type structures are composed of the so-called scissor-like elements (sles), which are connected to each other at an intermediate point through a pivotal connection and allow them to be folded into a compact bundle for storage or transport. several sles are connected to each other in order to form units with regular polygonal plan views. the sides and radii of the polygons are...
A Note on the Edge-Connectivity of Cages
A (k; g)-graph is a k-regular graph with girth g. A (k; g)-cage is a (k; g)-graph with the smallest possible number of vertices. In this paper we prove that (k; g)cages are k-edge-connected if k ≥ 3 and g is odd.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Communications Letters
سال: 2008
ISSN: 1089-7798
DOI: 10.1109/lcomm.2008.071843